例句與造句

1. To prove NP-completeness, it was shown that there is a polynomial reduction between the 3-partition problem, which is also NP-Complete, and the " Tetris " problem.
2. A problem is said to be strongly NP-hard if a strongly NP-complete problem has a polynomial reduction to it; in combinatorial optimization, particularly, the phrase " strongly NP-hard " is reserved for problems that are not known to have a polynomial reduction to another strongly NP-complete problem.
3. A problem is said to be strongly NP-hard if a strongly NP-complete problem has a polynomial reduction to it; in combinatorial optimization, particularly, the phrase " strongly NP-hard " is reserved for problems that are not known to have a polynomial reduction to another strongly NP-complete problem.
4. It's difficult to find polynomial reduction in a sentence. 用polynomial reduction造句挺難的